Distributed Stochastic Approximation Algorithm With Expanding Truncations
نویسندگان
چکیده
منابع مشابه
Markovian Stochastic Approximation with Expanding Projections
Abstract. Stochastic approximation is a framework unifying many random iterative algorithms occurring in a diverse range of applications. The stability of the process is often difficult to verify in practical applications and the process may even be unstable without additional stabilisation techniques. We study a stochastic approximation procedure with expanding projections similar to Andradótt...
متن کاملDistributed Stochastic Approximation with Local Projections
We propose a distributed version of a stochastic approximation scheme constrained to remain in the intersection of a finite family of convex sets. The projection to the intersection of these sets is also computed in a distributed manner and a ‘nonlinear gossip’ mechanism is employed to blend the projection iterations with the stochastic approximation using multiple time scales.
متن کاملApproximation of stochastic advection diffusion equations with finite difference scheme
In this paper, a high-order and conditionally stable stochastic difference scheme is proposed for the numerical solution of $rm Ithat{o}$ stochastic advection diffusion equation with one dimensional white noise process. We applied a finite difference approximation of fourth-order for discretizing space spatial derivative of this equation. The main properties of deterministic difference schemes,...
متن کاملNetwork Location Problem with Stochastic and Uniformly Distributed Demands
This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...
متن کاملA stochastic approximation algorithm with multiplicative step size adaptation
An algorithm of searching a zero of an unknown function φ : R → R is considered, xt = xt−1−γt−1yt, t = 1, 2, . . ., where yt = φ(xt−1)+ξt is the value of φmeasured at xt−1 with some error, ξt is this error. The step sizes γt > 0 are random positive values and are calculated according to the rule: γt = min{u γt−1, ḡ} if yt−1yt > 0, and γt = d γt−1, otherwise. Here 0 < d < 1 < u, ḡ > 0. The funct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2020
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2019.2912713